The McKinsey – Lemmon logic is barely canonical
نویسنده
چکیده
We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non-elementary. We also show that any axiomatisation of the logic involves infinitely many non-canonical formulas. MSC2000: 03B45.
منابع مشابه
McKinsey Algebras and Topological Models of S4.1
The aim of this paper is to show that every topological space gives rise to a wealth of topological models of the modal logic S4.1. The construction of these models is based on the fact that every topological space defines a Boolean closure algebra (to be called a McKinsey algebra) that neatly reflects the structure of the modal system S4.1 in that all its elements satisfy the topological inter...
متن کاملRemarks on Intuitionistic Modal Logics Observaciones sobre Lógicas Modales Intuicionistas
This paper is devoted to study an extension of intuitionistic modal logic introduced by Fischer-Servi [6] by means of Lemmon-Scott axiom. We shall prove that this logic is canonical.
متن کاملAxiomatizing hybrid logic using modal logic
We study hybrid logics with nominals and ‘actuality’ operators @i. We recall the method of ten Cate, Marx, and Viana to simulate hybrid logic using modalities and ‘nice’ frames, and we show that the hybrid logic of a class of frames is the modal logic of the class of its corresponding nice frames. Using these results, we show how to axiomatize the hybrid logic of any elementary class of frames....
متن کاملF . N ESCO Graded Modalities , II
This work intends to be a generalization and a simplification oI me tecm~,~=~o employed in [2], by the proposal of a general strategy to prove satisfiability theorems for NLGM-s ( normal logics with graded modalities), analogously to the well known technique of the canonical models by Lemmon and Scott for classical modal logics.
متن کاملCanonicity for Intensional Logics with Even Axioms
This paper looks at the concept of neighborhood canonicity introduced by BRIAN CHELLAS [2]. We follow the lead of the author’s paper [8] where it was shown that every non-iterative logic is neighborhood canonical and here we will show that all logics whose axioms have a simple syntactic form—no intensional operator is in boolean combination with a propositional letter—and which have the finite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006